package com.wc.AlgoOJ.LQ0909_乘积最大;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.StringTokenizer;

/**
 * @Author congge
 * @Date 2024/3/21 13:02
 * @description http://43.138.190.70:8888/p/LQ0909
 */
public class Main {
    static FastReader sc = new FastReader();
    static PrintWriter out = new PrintWriter(System.out);
    static int N = 100010;
    static int[][] a = new int[N][2];
    static boolean[] st = new boolean[N];
    static int P = (int) 1e9 + 9;
    static int n, k;

    public static void main(String[] args) {
        n = sc.nextInt();
        int pos = 0, neg = 0, zero = 0;
        for (int i = 1; i <= n; i++) {
            a[i][0] = sc.nextInt();
            if (a[i][0] > 0) {
                pos++;
                a[i][1] = 1;
            } else if (a[i][0] == 0) {
                zero++;
                a[i][0] = 0;
            } else {
                neg++;
                a[i][1] = -1;
            }
            a[i][0] = Math.abs(a[i][0]);
        }
        Arrays.sort(a, 1, n + 1, Comparator.comparingInt(o -> -o[0]));
        // 首先要判断是正数还是负数
        if ((k & 1) == 0) {
            // 百分之百正数
            if (pos >= k - neg / 2 * 2) {
                long res = 1;
                int n1 = 0, n2 = 0;
                for (int i = 1; i <= k; i++) {
                    if (a[i][1] > 0) n1++;
                    else n2++;
                }
                if (n2 % 2 != 0) {

                }

            } else {

            }
        } else {
            // 百分之百正数
            if (pos >= 1 && pos >= k - neg / 2 * 2) {

            } else {

            }
        }
    }
}

class FastReader {
    StringTokenizer st;
    BufferedReader br;

    FastReader() {
        br = new BufferedReader(new InputStreamReader(System.in));
    }

    String next() {
        while (st == null || !st.hasMoreElements()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }

    int nextInt() {
        return Integer.parseInt(next());
    }

    String nextLine() {
        String s = "";
        try {
            s = br.readLine();
        } catch (IOException e) {
            e.printStackTrace();
        }
        return s;
    }

    long nextLong() {
        return Long.parseLong(next());
    }

    double nextDouble() {
        return Double.parseDouble(next());
    }

    // 是否由下一个
    boolean hasNext() {
        while (st == null || !st.hasMoreTokens()) {
            try {
                String line = br.readLine();
                if (line == null)
                    return false;
                st = new StringTokenizer(line);
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return true;
    }
}
